Subdivision Surfaces for Fast Approximate Implicit Polygonization
نویسندگان
چکیده
We propose a fast method of generating an approximate polygonal mesh from an implicit surface. Current workstations are still not capable of producing polygon meshes fast enough for the interactive modelling of complex implicit models. We propose a hybrid method that combines current implicit polygonization techniques with the faster sub-division surface technique applied as a post-process to smooth the implicit mesh. In an interactive enviroment the smooth mesh points can be migrated to the implicit surface, in idle moments when the user is not interacting with the model. The technique can be further enhanced by providing tools for the user to indicate areas of interest that can be preferentially smoothed.
منابع مشابه
Edge spinning algorithm for implicit surfaces ✩
This paper presents a new fast method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles generated and on the polygonization speed. The main advantages of the triangulation presented are simplicity and the stable features that can be used for future expansion. The implementation is not complicated and only the standard data structures are used. This algor...
متن کاملSpace Subdivision for Fast Polygonization of Implicit Surfaces
This paper presents the basic principles for the visualization of objects which are defined by implicit functions and CSG trees. The basic principles (Marching cubes, Marching tetrahedra and Marching triangles) for iso-surfaces rendering of such objects are compared. A new fast modification of the Marching triangles algorithm is presented and compared with others algorithms. It is based on the ...
متن کاملDynamic Meshes for Accurate Polygonization of Implicit Surfaces with Sharp Features
The paper presents a novel approach for accurate polygonization of implicit surfaces with sharp features. The approach is based on mesh evolution towards a given implicit surface with simultaneous control of the mesh vertex positions and mesh normals.
متن کاملPolygonization of Implicit Surfaces on Multi-Core Architectures with SIMD Instructions
In this research we tackle the problem of rendering complex models which are created using implicit primitives, blending operators, affine transformations and constructive solid geometry in a design environment that organizes all these in a scene graph data structure called BlobTree. We propose a fast, scalable, parallel polygonization algorithm for BlobTrees that takes advantage of multicore p...
متن کاملON ESCHER’S SPIRALS Polygonization of 2-manifolds with boundaries
An algorithm of polygonization of trimmed implicit surfaces yielding surface sheets is presented. These twodimensional manifolds with boundaries result from the set-theoretic difference of an implicit surface and a solid. The algorithm generates the polygonal approximation of the trimmed surface with the mesh adaptation to the manifold boundary.
متن کامل